Parallel Performance of Adaptive Algorithms with Dynamic Load Balancing
نویسندگان
چکیده
Parallelization of adaptive algorithms leads to problems with parallel efficiency. Adaptation is a method which introduces dynamic perturbations to computational environment. This in turn causes problems with proper load balance. To ensure proper efficiency of a parallel simulation it is necessary to perform load balancing whenever certain threshold of load balance is breached. In this paper authors present their approach to parallel anisotropic adaptation on unstructured meshes. High parallel efficiency of the code is maintained through the use of dynamic load balancing algorithm. Measurements of parallel efficiency of an adaptive and dynamically load balanced flow application are presented.
منابع مشابه
A comparison of some dynamic load-balancing algorithms for a parallel adaptive flow solver
In this paper we contrast the performance of three different parallel dynamic load-balancing algorithms when used in conjunction with a particular parallel, adaptive, time-dependent, 3-d ow solver that has recently been developed at Leeds. An overview of this adaptive solver is given along with a description of a new dynamic load-balancing algorithm. The eeectiveness of this algorithm is then a...
متن کاملA Performance Characterization of Load Balancing Algorithms for Parallel SAMR Applications
We perform a comprehensive performance characterization of load balancing algorithms for parallel structured adaptive mesh refinement (SAMR) applications. Using SAMR, computational resources are dynamically concentrated to areas in need of a high accuracy. Because of the dynamic resource allocation, the workload must repeatedly be partitioned and distributed over the processors. For an efficien...
متن کاملPerformance Analysis of Load Balancing Algorithms
Load balancing is the process of improving the performance of a parallel and distributed system through a redistribution of load among the processors [1] [5]. In this paper we present the performance analysis of various load balancing algorithms based on different parameters, considering two typical load balancing approaches static and dynamic. The analysis indicates that static and dynamic bot...
متن کاملParleda: a Library for Parallel Processing in Computational Geometry Applications
ParLeda is a software library that provides the basic primitives needed for parallel implementation of computational geometry applications. It can also be used in implementing a parallel application that uses geometric data structures. The parallel model that we use is based on a new heterogeneous parallel model named HBSP, which is based on BSP and is introduced here. ParLeda uses two main lib...
متن کاملParallel Dynamic Load-Balancing for the Solution of Transient CFD Problems Using Adaptive Tetrahedral Meshes
This paper considers a new parallel dynamic load-balancing algorithm which has been developed for use in conjunction with an unstructured tetrahedral parallel adaptive solver for transient ow problems. A brief description of the 3-d adaptivity algorithm is then followed by a discussion of the load-balancing problem. The practical load-balancing algorithm is then explained, followed by a discuss...
متن کامل